A Bounded Formulation for The School Bus Scheduling Problem

This paper proposes a new formulation for the school bus scheduling problem (SBSP), which optimizes start times and operation to minimize transportation cost. The goal is number of buses serve all routes such that each route arrives in time window before starts. We show introducing context-specific features, common many districts, can lead time-indexed integer linear programming (ILP) formulation. Based on strengthened version relaxation ILP, we develop dependent randomized rounding algorithm yields near-optimal solutions large-scale instances. efficient solution approach enable quick generation multiple facilitate strategic planning, demonstrate with data from two public districts United States. also generalize our methodologies solve robust SBSP.